A Non - interactive Public - Key
نویسنده
چکیده
An identity-based non-interactive public key distribution system is presented that is based on a novel trapdoor one-way function allowing a trusted authority to compute the discrete logarithms modulo a publicly known composite number m while this is infeasible for an adversary not knowing the factorization of m. Without interaction with a key distribution center or with the recipient of a given message, a user can generate a mutual secure cipher key based solely on the recipient's identity and his own secret key, and subsequently send the message, encrypted with the generated cipher used in a conventional cipher, over an insecure channel to the recipient. In contrast to previously proposed identity-based systems, no public keys, certiicates for public keys or other information need to be exchanged and thus the system is suitable for certain applications that do not allow for interaction. The paper solves an open problem proposed by Shamir in 1984.
منابع مشابه
The Impact of Management Control Systems on Contemporary Management Accounting Practices in the Public Sector
The purpose of this paper is to investigate the effect of the interactive and diagnostic use of management control systems on the adoption and success of contemporary management accounting practices in the public sector. Contemporary management accounting practices includes: benchmarking, activity-based costing, the balanced scorecard, value chain analysis, total quality management, key perform...
متن کاملPublic-Randomness in Public Key Cryptography
In this work WC investigate the power of Public Randomness in the context of Public-key cryptosystcms. We consider the Diffie-Bellman Public-key model in which an additional short random string is shared by all users. This, which we call Public-Key Public-Randomness (PKPR) model, is very powerful as we show that it supports simple non-interactive implementations of important cryptographic primi...
متن کاملPublic-key Cryptosystems Provably Secure against Chosen Ciphertext Attacks
We show how to construct a public-key cryptosystem (as originally deened by Diie and Hellman) secure against chosen ciphertext attacks, given a public-key cryptosystem secure against passive eavesdropping and a non-interactive zero-knowledge proof system in the shared string model. No such secure cryptosystems were known before.
متن کاملNon-interactive Zero-Knowledge from Homomorphic Encryption
We propose a method for compiling a class of Σ-protocols (3-move public-coin protocols) into non-interactive zero-knowledge arguments. The method is based on homomorphic encryption and does not use random oracles. It only requires that a private/public key pair is set up for the verifier. The method applies to all known discrete-log based Σ-protocols. As applications, we obtain non-interactive ...
متن کاملNon-interactive Opening for Ciphertexts Encrypted by Shared Keys
Let a sender Alice computes a ciphertext C of a message M by using a receiver Bob’s public key pkB . Damg̊ard, Hofheinz, Kiltz, and Thorbek (CT-RSA2008) has proposed the notion public key encryption with non-interactive opening (PKENO), where Bob can make an noninteractive proof π that proves the decryption result of C under skB is M , without revealing skB itself. When Bob would like to prove t...
متن کاملForward Secure Non-Interactive Key Exchange
Exposure of secret keys is a major concern when cryptographic protocols are implemented on weakly secure devices. Forward security is thus a way to mitigate damages when such an event occurs. In a forward-secure scheme, the public key is indeed fixed while the secret key is updated with a oneway process at regular time periods so that security of the scheme is ensured for any period prior to th...
متن کامل